Tight upper tail bounds for cliques
نویسندگان
چکیده
منابع مشابه
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problemin automata theory, but also serves as a cornerstone for solving numerous decision problemsin mathematical logic, model-checking, program analysis and verification. For Streett comple-mentation, a significant gap exists between the current lower bound 2 lgnk) and upper bound2 lg , where n i...
متن کاملAlmost Tight Upper Bounds for Lower Envelopes in Higher Dimensions
We show that the combinatorial complexity of the lower envelope of n surfaces or surface patches in dspace ( d 2 3), all algebraic of constant maximum degree, and bounded by algebraic surfaces of constant maximum degree, is O(rkl+') , for any E > 0; the constant of proportionality depends on E , d, and the shape and degree of the surface patches and of their boundaries. This is the first nontri...
متن کاملTight Upper Bounds for Cell Loss Probabilities in ATM
Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...
متن کاملImproved Bounds for the Ramsey Number of Tight Cycles Versus Cliques
The 3-uniform tight cycle C s has vertex set Zs and edge set {{i, i+ 1, i+ 2} : i ∈ Zs}. We prove that for every s 6≡ 0 (mod 3) and s ≥ 16 or s ∈ {8, 11, 14} there is a cs > 0 such that the 3-uniform hypergraph Ramsey number r(C s ,K n ) satisfies r(C s ,K n ) < 2cn . This answers in strong form a question of the author and Rödl who asked for an upper bound of the form 2n 1+ǫs for each fixed s ...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2012
ISSN: 1042-9832
DOI: 10.1002/rsa.20440